Some Remarks on Lucas-Based Cryptosystems
نویسندگان
چکیده
We review the well-known relation between Lucas sequences and exponentiation. This leads to the observation that certain public-key cryptosystems that are based on the use of Lucas sequences have some elementary properties their re-inventors were apparently not aware of. In particular, we present a chosen-message forgery for ‘LUC’ (cf. [21; 25]), and we show that ‘LUCELG’ and ‘LUCDIF’ (cf. [22, 261) are vulnerable to subexponential time attacks. This proves that various claims that were made about Lucas-based cryptosystems are incorrect.
منابع مشابه
Cryptanalysis of RSA-type cryptosystems: A visit
This paper surveys RSA-type implementations based on Lucas sequences and on elliptic curves. The main focus is the way how some known attacks on RSA were extended to LUC, KMOV and Demytko’s system. It also gives some directions for the choice of the most appropriate RSA-type system for a given application.
متن کاملCompression in Finite Fields and Torus-Based Cryptography
We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key cryptosystems called T2 and CEILIDH, we disprove some conjectures, and we use the theory of algebraic tori to give a better understanding of our cryptosystems, the Lucas-based, XTR and Gong-Harn cryptosystems, and conjectured ge...
متن کاملFrom MQ to MQQ Cryptography: Weaknesses & New Solutions
Public Key Cryptosystems have been in use for more than three decades. A number of schemes based on integer factorization problem, discrete log problem, residuosity problem, digital signature methods, Lucas sequence, Lattice problems, error-correcting codes, braid groups etc. have been designed. Recently, Multivariate Quadratic (MQ) Polynomials could be efficiently used for design of a number o...
متن کاملCritical Remarks on "critical Remarks on Some Public-key Cryptosystems" by T. Herlestam
Tore Herlestam, in his note "Critical Remarks on Some Public-Key Cryptosystems", [5] suggests a method for attacking the RSA public-key cryptosystem. In this note we show that Herlestam's proposed attack is highly impractical, and that his analysis is erroneous. The RSA cryptosystem [1] encodes a message M using the key (e,n) via the equation: (1) C =E ~ ( M ) M e (modn) . Here the original mes...
متن کاملSOME REMARKS ON WEAKLY INVERTIBLE FUNCTIONS IN THE UNIT BALL AND POLYDISK
We will present an approach to deal with a problem of existence of (not) weakly invertible functions in various spaces of analytic functions in the unit ball and polydisk based on estimates for integral operators acting between functional classes of different dimensions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995